Subspace Designs Based on Algebraic Function Fields

Subspace designs are a (large) collection of high-dimensional subspaces {Hi} of Fq such that for any low-dimensional subspace W , only a small number of subspaces from the collection have non-trivial intersection with W ; more precisely, the sum of dimensions of W ∩Hi is at most some parameter L. The notion was put forth by Guruswami and Xing (STOC’13) with applications to list decoding variants of Reed-Solomon and algebraic-geometric codes, and later also used for explicit rank-metric codes with optimal list decoding radius. Guruswami and Kopparty (FOCS’13, Combinatorica’16) gave an explicit construction of subspace designs with near-optimal parameters. This construction was based on polynomials and has close connections to folded Reed-Solomon codes, and required large field size (specifically q > m). Forbes and Guruswami (RANDOM’15) used this construction to give explicit constant degree “dimension expanders" over large fields, and noted that subspace designs are a powerful tool in linear-algebraic pseudorandomness. Here, we construct subspace designs over any field, at the expense of a modest worsening of the bound L on total intersection dimension. Our approach is based on a (non-trivial) extension of the polynomial-based construction to algebraic function fields, and instantiating the approach with cyclotomic function fields. Plugging in our new subspace designs in the construction of Forbes and Guruswami yields dimension expanders over F for any field F, with logarithmic degree and expansion guarantee for subspaces of dimension Ω(n/(log logn)). 1998 ACM Subject Classification F.2.1 Numerical Algorithms and Problems, F.2.2 Nonnumerical Algorithms and Problems, G.1.3 Numerical Linear Algebra